منابع مشابه
Stability concepts in matching under distributional constraints
Many real matching markets are subject to distributional constraints. To guide market designers faced with constraints, we propose new stability concepts. A matching is strongly stable if satisfying blocking pairs inevitably violates a constraint. We show that a strongly stable matching may not exist, and that existence is guaranteed if and only if all distributional constraints are trivial. To...
متن کاملOptimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملOptimal Fuzzy Controller Mapped from LQR under Power and Torque Constraints
Dealing with a LQR controller surface subject to power and torque constraints, is an issue of nonlinear problem that is difficult to implement. This paper employs a fuzzy controller surface to replace the LQR surface subject to power and torque constraints by using class stacking, least square and Sugenotype fuzzy inference mode. Through this type of transformation, called “Optimal fuzzy contro...
متن کاملAutomatic Reasoning for Design Under Geometric Constraints
Parametric design is very stable but requires a predefined dimensioning and ordering scheme, thus limiting flexibility and precluding sketch input. Variational geometry design, while general and flexible, necessitates intensive use of numerical solvers to solve many simultaneous nonlinear equations. Frequently the solvers cannot solve these equations. A new system, based on an original theory f...
متن کاملFiberoptic circuit network design under reliability constraints
The network design problem with reliability constraints is a problem where, given a finite set of nodes, the objective is a costefficient selection of links and link capacities sufficient to satisfy the node-to-node traffic demands in normal and failed conditions. In this paper, we present a general mathematical model for this problem and a revised formulation which seems particularly appropria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.1566